A characterization of substitutive sequences using return words

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A characterization of substitutive sequences using return words

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.

متن کامل

Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.

متن کامل

Sequences with constant number of return words

An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m − 1)n + 1 and if it contains no weak bispecial factor. These conditions are necessary for m = 3, whereas for m = 4 the complexity function need not be 3n + 1. A new class of words satisfying Rm is...

متن کامل

A Characterization of Sturmian Words by Return Words

1 R esum e: Nous pr esentons une nouvelle caract erisation des mots de Sturm bas ee sur les mots de retour. Si l'on consid ere chaque occurrence d'un mot w dans un mot innni r ecurrent, on d eenit l'ensemble des mots de retour de w comme l'ensemble de tous les mots distincts commenn cant par une occurrence de w et nissant exactement avant l'occurrence suivante de w. Le r esultat principal montr...

متن کامل

Return Words in the Thue-morse and Other Sequences

We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)00029-0